Multiple Tree Multicast in a Dynamic Environment
نویسندگان
چکیده
Multiple multicast trees have been shown to increase the performance of data distribution when compared with single tree multicast. Node loss and congestion changes the performance characteristics of the multicast trees. Multicast tree performance feedback can be used to determine the optimal tree to use based on the feedback. We further examine an optimizing methodology, Probabilistic Multicast Trees (PMT), for multiple multicast trees which makes use of the performance feedback, generates a probability of usage for each multicast tree based on that feedback and then makes intelligent choices about which multicast tree to use for a given packet in the presence of node loss and congestion.
منابع مشابه
A Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملProbabilistic Multicast Trees in Different Network Topology Environments
Node loss and congestion changes the performance characteristics of the multicast trees. Probabilistic Multicast Trees (PMT) makes use of performance feedback, generates a probability of usage for each multicast tree based on that feedback and then makes intelligent choices about which multicast tree to use for a given packet in the presence of node loss and congestion. The advantage gained by ...
متن کاملMulticast Routing Algorithms in High Speed Networks
We propose two multicast routing algorithms in this paper. One is a delay-constrained multicast algorithm that nds a multicast tree between one source node and multiple destination nodes. The other is a dynamic multicast algorithm that allows multiple nodes to dynamically join or leave a multicast group during a session. The rst algorithm, which provides multicas-ting and guaranteed QoS(Quality...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملA Lightweight Prepositioned Secret Sharing Tree for Multicast Key Management
Secure group communications are increasingly used in the continuous growth of the Internet applications. In a secure multicast environment, an identical data can be efficiently delivered from a source to multiple receivers within a dynamic group. A simple solution is to encrypt the transmitted data using a symmetric key. However, scalable group rekeying is the main challenge for large and dynam...
متن کامل